Solving the Sabotage Game Is PSPACE-Hard
نویسندگان
چکیده
We consider the sabotage game as presented by van Benthem. In this game one player moves along the edges of a finite multigraph and the other player takes out a link after each step. One can consider usual algorithmic tasks like reachability, Hamilton path, or complete search as winning conditions for this game. As the game definitely ends after at most the number of edges steps, it is easy to see that solving the sabotage game for the mentioned tasks takes at most PSPACE in the size of the graph. In this paper we establish the PSPACE-hardness of this problem. Furthermore, we introduce a modal logic over changing models to express tasks corresponding to the sabotage games and we show that model checking this logic is PSPACE-complete.
منابع مشابه
The Complexity of Reachability in Randomized Sabotage Games
We analyze a model of fault-tolerant systems in a probabilistic setting. The model has been introduced under the name of “sabotage games”. A reachability problem over graphs is considered, where a “Runner” starts from a vertex u and seeks to reach some vertex in a target set F while, after each move, the adversary “Blocker” deletes one edge. Extending work by Löding and Rohde (who showed PSpace...
متن کاملOn the µ-Calculus Augmented with Sabotage
We study logics and games over dynamically changing structures. Van Benthem’s sabotage modal logic consists of modal logic with a cross-model modality referring to submodels from which a transition has been removed. We add constructors for forming least and greatest monadic fixed-points to that logic and obtain the sabotage μ-calculus. We introduce backup parity games as an extension of standar...
متن کاملPhutball is PSPACE-hard
We consider the n × n game of Phutball. It is shown that, given an arbitrary position of stones on the board, it is a PSPACE-hard problem to determine whether the specified player can win the game, regardless of the opponent’s choices made during the game.
متن کاملMoving in a network under random failures: A complexity analysis
We analyze a model of fault-tolerant systems in a probabilistic setting, exemplified by a simple routing problem in networks. We introduce a randomized variant of a model called the “sabotage game”, where an agent, called “Runner”, and a probabilistic adversary, “Nature”, act in alternation. Runner generates a path from a given start vertex of the network, traversing one edge in each move, whil...
متن کاملSuper Mario Bros. is Harder/Easier Than We Thought
Mario is back! In this sequel, we prove that solving a generalized level of Super Mario Bros. is PSPACE-complete, strengthening the previous NP-hardness result (FUN 2014). Both our PSPACE-hardness and the previous NP-hardness use levels of arbitrary dimensions and require either arbitrarily large screens or a game engine that remembers the state of off-screen sprites. We also analyze the comple...
متن کامل